Coarse distinguishability of graphs with symmetric growth

نویسندگان

چکیده

Let X be a connected, locally finite graph with symmetric growth. We prove that there is vertex coloring ϕ : → {0, 1} and some R ∈ ℝ such every automorphism f preserving -close to the identity map; this can seen as coarse geometric version of symmetry breaking. also infinite motion conjecture true for graphs where at least one stabilizer S x satisfies following condition: non-identity , sequence n lim d ( )) = ∞ .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coarse-grained distinguishability of field interactions

Information-theoretical quantities such as statistical distinguishability typically result from optimisations over all conceivable observables. Physical theories, however, are not generally considered valid for all mathematically allowed measurements. For instance, quantum field theories are not meant to be correct or even consistent at arbitrarily small lengthscales. A general way of limiting ...

متن کامل

Classifying pentavalnet symmetric graphs of order $24p$

A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.

متن کامل

Distinguishability of Infinite Groups and Graphs

The distinguishing number of a group G acting faithfully on a set V is the least number of colors needed to color the elements of V so that no non-identity element of the group preserves the coloring. The distinguishing number of a graph is the distinguishing number of its automorphism group acting on its vertex set. A connected graph Γ is said to have connectivity 1 if there exists a vertex α ...

متن کامل

Cubic symmetric graphs of orders $36p$ and $36p^{2}$

A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

متن کامل

Symmetric Bipartite Graphs and Graphs with Loops

We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges its two parts. To prove this, we study the relationship between symmetric bipartite graphs and graphs with loops.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ars Mathematica Contemporanea

سال: 2021

ISSN: ['1855-3974', '1855-3966']

DOI: https://doi.org/10.26493/1855-3974.2354.616